The Cubetree Storage Organization

نویسندگان

  • Nick Roussopoulos
  • Yannis Kotidis
چکیده

The Relational On-Line Analytical Processing (ROLAP) is emerging as the dominant approach in data warehousing. In order to enhance query performance, the ROLAP approach relies on selecting and materializing in summary tables appropriate subsets of aggregate views which are then engaged in speeding up OLAP queries. However, a straight forward relational storage implementation of materialized ROLAP views is immensely wasteful on storage and incredibly inadequate on query performance and incremental update speed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cubetree: Organization of and Bulk Incremental Updates on the Data Cube

The data cube is an aggregate operator which has been shown to be very powerful for On Line Analytical Processing (OLAP) in the context of data warehousing. It is, however, very expensive to compute, access, and maintain. In this paper we de ne the \cubetree" as a storage abstraction of the cube and realize it using packed R-trees for most e cient cube queries. We then reduce the problem of cre...

متن کامل

Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments

Range-aggregate queries on the data cube are powerful tools for analysis in data warehouse environments. Cubetree is a technique materializing a data cube through an R-tree. It provides efficient data accessibility, but involves some drawbacks to traverse all the internal and leaf nodes within given query ranges to compute range-aggregate queries. In this paper, we propose a novel index structu...

متن کامل

Ag-tree: an Index Structure for Range-aggregation Queries in Data Warehouse Environments

Range-aggregate queries are popular in many applications in data warehouse environments with large business relational databases. To evaluate these efficiently, several studies on data cubes (such as the aggregate cubetree) have been carried out. In the wellknown aggregate cubetree, each entry in every node stores the aggregate values of its corresponding subtree. Therefore, range-aggregate que...

متن کامل

Structure Preserving Approximations of Conservative Forces for Application to Small-Body Dynamics

Approximation-based methods, such as the cubetree algorithm, have proven to be significantly faster than traditionalmethods for complex force evaluations near small irregular bodies. Suchmethods also hold the promise of simplifying the inclusion of experimental data to update the force model. However, the cubetree algorithm does not preserve intrinsic properties of the gravitational force such ...

متن کامل

Impact of Storage Fungi on Soybean Seed Deterioration in Different Storage Conditions and Seed Moisture Content

DOR: 98.1000/2383-1251.1398.6.65.11.1. 1578.1585 Extended Abstract Introduction: Understanding the complex characteristics that control the life span of the seed has ecological, agricultural and economic importance. Inappropriate storage conditions after harvesting destroy a large part of annual yield partly due to microbial activity in the storage. Damage from storage fungi varies based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998